A Comprehensive Test Pattern Generation Approach Exploiting the SAT Attack for Logic Locking
نویسندگان
چکیده
The need for reducing manufacturing defect escape in today's safety-critical applications requires increased fault coverage. However, generating a test set using commercial automatic pattern generation (ATPG) tools that lead to zero-defect is still an open problem. It challenging detect all stuck-at faults reach 100% In parallel, the hardware security community has been actively involved developing solutions logic locking prevent IP piracy. locking, locks are inserted different locations of netlist modify original functionality. Unless correct key programmed into IC, circuit functions incorrectly. Unfortunately, Boolean satisfiability (SAT) based attack, introduced [1], can determine secret efficiently, and break schemes. this paper, we propose novel approach powerful SAT attack on locking. A modeled as locked gate with key, where it effectively deduce satisfiable assignment reduced backtracks under initialization attack. input determines fault. We two approaches generation. First, single targeted, corresponding one bit created. This generates per Second, consider group convert its version multiple bits. inputs obtained from tool detecting faults. Our find patterns hard-to-detect were previously undetected ATPG tools. proposed efficiently redundant well. demonstrate effectiveness ITC'99 benchmarks. results show identify stuck coverage achieved. addition, time saving becomes significant Approach 2 help reduce or remove conflicts.
منابع مشابه
Mitigating SAT Attack on Logic Locking
Logic locking is a technique that has been proposed to protect outsourced IC designs from piracy and counterfeiting by untrusted foundries. A locked IC preserves the correct functionality only when a correct key is provided. Recently, the security of logic locking is threatened by a new attack called SAT attack, which can decipher the correct key of most logic locking techniques within a few ho...
متن کاملAnti-SAT: Mitigating SAT Attack on Logic Locking
Logic locking is a technique that’s proposed to protect outsourced IC designs from piracy and counterfeiting by untrusted foundries. A locked IC preserves the correct functionality only when a correct key is provided. Recently, the security of logic locking is threatened by a new attack called SAT attack, which can decipher the correct key of most logic locking techniques within a few hours [1]...
متن کاملSAT-based Automatic Test Pattern Generation
Due to the rapidly growing size of integrated circuits, there is a need for new algorithms for Automatic Test Pattern Generation (ATPG). While classical algorithms reach their limit, there have been recent advances in algorithms to solve Boolean Satisfiability (SAT). Because Boolean SAT solvers are working on Conjunctive Normal Forms (CNF), the problem has to be transformed. During transformati...
متن کاملExploiting Dynamically Propositional Logic Structures in SAT
The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains still unsolvable in every SAT competition. This paper focuses on solving problems such as hwb-n32. Generally speaking, modern solvers can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas (propositional ...
متن کاملA Comprehensive Approach to Assessing and Analyzing 1149.1 Test Logic
In this paper we introduce a tool which is capable of verifying an 1149.1 test logic implementation and its compliance to the IEEE 1149.1 Standard [1][2] while providing a precise list of errors as well as good debug and diagnostic information using graphical analysis. The paper provides a review of the methods used to perform the logic verification. We introduce an efficient technique for veri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2023
ISSN: ['1557-9956', '2326-3814', '0018-9340']
DOI: https://doi.org/10.1109/tc.2023.3248268